|
In mathematics, a partial equivalence relation (often abbreviated as PER, in older literature also called restricted equivalence relation) on a set is a relation that is ''symmetric'' and ''transitive''. In other words, it holds for all that: # if , then (symmetry) # if and , then (transitivity) If is also reflexive, then is an equivalence relation. == Properties and applications == In a set-theoretic context, there is a simple structure to the general PER on : it is an equivalence relation on the subset . ( is the subset of such that in the complement of () no element is related by to any other.) By construction, is reflexive on and therefore an equivalence relation on . Notice that is actually only true on elements of : if , then by symmetry, so and by transitivity. Conversely, given a subset ''Y'' of ''X'', any equivalence relation on ''Y'' is automatically a PER on ''X''. PERs are therefore used mainly in computer science, type theory and constructive mathematics, particularly to define setoids, sometimes called partial setoids. The action of forming one from a type and a PER is analogous to the operations of subset and quotient in classical set-theoretic mathematics. Every partial equivalence relation is a difunctional relation, but the converse does not hold. The algebraic notion of congruence can also be generalized to partial equivalences, yielding the notion of subcongruence, i.e. a homomorphic relation that is symmetric and transitive, but not necessarily reflexive. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Partial equivalence relation」の詳細全文を読む スポンサード リンク
|